Interactive Reference Point Procedure Based on the Conic Scalarizing Function

نویسنده

  • Ozden Ustun
چکیده

In multiobjective optimization methods, multiple conflicting objectives are typically converted into a single objective optimization problem with the help of scalarizing functions. The conic scalarizing function is a general characterization of Benson proper efficient solutions of non-convex multiobjective problems in terms of saddle points of scalar Lagrangian functions. This approach preserves convexity. The conic scalarizing function, as a part of a posteriori or a priori methods, has successfully been applied to several real-life problems. In this paper, we propose a conic scalarizing function based interactive reference point procedure where the decision maker actively takes part in the solution process and directs the search according to her or his preferences. An algorithmic framework for the interactive solution of multiple objective optimization problems is presented and is utilized for solving some illustrative examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound

We propose an interactive reference point approach for multiple objective (mixed) integer linear programming problems that exploits the use of branch-and-bound techniques for solving the scalarizing programs. At each dialogue phase, the decision maker must specify a criterion reference point or just choose an objective function he/she wants to improve in respect to the previous ecient (nondomi...

متن کامل

A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm

In this paper, we discuss the idea of incorporating preference information into evolutionary multiobjective optimization and propose a preference-based evolutionary approach that can be used as an integral part of an interactive algorithm. One algorithm is proposed in the paper. At each iteration, the decision maker is asked to give preference information in terms of her/his reference point con...

متن کامل

Generalized Scalarizing Model GENS in DSS WebOptim

A web-based Decision Support System WebOptim for solving multiple objective optimization problems is presented. Its basic characteristics are: user-independent, multisolver-admissibility, method-independent, heterogeneity, web-accessibility. Core system module is an original generalized interactive scalarizing method. It incorporates a number of thirteen interactive methods. Most of the known s...

متن کامل

WOWA Enhancement of the Preference Modeling in the Reference Point Method

The Reference Point Method (RPM) is an interactive technique formalizing the so-called quasi-satisficing approach to multiple criteria optimization. The DM’s preferences are there specified in terms of reference (target) levels for several criteria. The reference levels are further used to build the scalarizing achievement function which generates an efficient solution when optimized. Typical R...

متن کامل

A comparison of two reference point methods in multiple objective mathematical programming

When making decisions with multiple criteria, a decision maker often thinks in terms of an aspiration point or levels of achievement for the criteria. In multiple objective mathematical programming, solution methods based on aspiration points can generate nondominated solutions using a variety of scalarizing functions. These reference point solution methods commonly use a scalarizing function t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 2014  شماره 

صفحات  -

تاریخ انتشار 2014